#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL p[70];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  p[0]=1;
  for(LL i=1;i<=62;i++) p[i]=p[i-1]*2;
  LL t;cin>>t;
  while(t--){
    LL l,r;cin>>l>>r;
    if(l==r){
        cout<<l<<"\n";
    }
    else{
        LL sum=0;LL num1=0;
        bool flag=1;
        for(LL i=62;i>=0;i--){
            if((p[i]&r)&&(p[i]&l)) num1++,sum+=p[i];
            if((p[i]&r)!=(p[i]&l)){
                flag=0;
                for(LL j=i-1;j>=0;j--){
                    sum+=(p[j]);
                    num1++;
                }
            }
            if(0==flag) break;
        }
        LL ans=0;LL num2=0;
        for(LL i=62;i>=0;i--){
            if(p[i]&r){
                num2++;
                ans+=p[i];
            }
        }
        if(num1==num2){
            cout<<min(sum,ans)<<"\n";
        }
        else if(num1>num2){
            cout<<sum<<"\n";
        }
        else cout<<ans<<"\n";
    }
  }
return 0;
}
